Entropy, character theory and centrality of finite quasigroups
نویسندگان
چکیده
منابع مشابه
On pm$^+$ and finite character bi-amalgamation
Let $f:Arightarrow B$ and $g:A rightarrow C$ be two ring homomorphisms and let $J$ and $J^{'}$ be two ideals of $B$ and $C$, respectively, such that $f^{-1}(J)=g^{-1}(J^{'})$. The bi-amalgamation of $A$ with $(B,C)$ along $(J,J^{'})$ with respect of $(f,g)$ is the subring of $Btimes C$ given by $Abowtie^{f,g}(J,J^{'})={(f(a)+j,g(a)+j^{'})/ a in A, (j,j^{'}) in Jtimes J^{'}}.$ In ...
متن کاملFinite black hole entropy and string theory.
An accelerating observer sees a thermal bath of radiation at the Hawking temperature which is proportional to the acceleration. Also, in string theory there is a Hagedorn temperature beyond which one cannot go without an infinite amount of energy. Several authors have shown that in the context of Hawking radiation a limiting temperature for string theory leads to a limiting acceleration, which ...
متن کاملEntropy operator for continuous dynamical systems of finite topological entropy
In this paper we introduce the concept of entropy operator for continuous systems of finite topological entropy. It is shown that it generates the Kolmogorov entropy as a special case. If $phi$ is invertible then the entropy operator is bounded with the topological entropy of $phi$ as its norm.
متن کاملRATIONAL CHARACTER TABLE OF SOME FINITE GROUPS
The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...
متن کاملOn check character systems over quasigroups and loops
In this article we study check character systems that is error detecting codes, which arise by appending a check digit an to every word a1a2...an−1 : a1a2...an−1 → a1a2...an−1an with the check formula (...((a1 · δa2) · δ 2a3)...) · δ n−2an−1) · δ n−1an = c, where Q(·) is a quasigroup or a loop, δ is a permutation of Q, c ∈ Q. We consider detection sets for such errors as transpositions (ab → ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 1990
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004100069334